Term-Rewriting Implementation of Equational Logic Programming
نویسنده
چکیده
1987 ABSTRACT In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equa-tional program, with run-time speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very brieey, concentrating on shortcomings and directions for future work.
منابع مشابه
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we show a method for implementing many equational theories with a limited class of logic programs. We de ne regular equational theories, a useful class of theories, and illustrate with a number of examples how our method ca...
متن کاملUCG-E: An Equational Logic Programming System
UCG-E (Hamel, 1991) is an equational logic programming system inspired by O’Donnell’s system (O’Donnell, 1985) and was designed to allow the integration of logic systems into imperative style programming environments. Equational logic systems are interesting, since they may be implemented very efficiently with term rewriting systems (Herman, 1991). Backtracking, a major source of inefficiencies...
متن کاملMaude: Speciication and Programming in Rewriting Logic ?
Maude is a high-level language and a high-performance system supporting exe-cutable speciication and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational speciication and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that ha...
متن کاملBreeding Algebraic Structures - An Evolutionary Approach To Inductive Equational Logic Programming
Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences th...
متن کاملTerm Equational Rewrite Systems and Logics
We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to s...
متن کامل